Approximability of Bounded Occurrence Max Ones
نویسنده
چکیده
We study the approximability of MAX ONES when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number of occurrences is three or more and a partial classification when the bound is two. For the non-conservative case we prove that it is either trivial or equivalent to the corresponding conservative problem under polynomial-time many-one reductions.
منابع مشابه
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations
We study the combinatorial problem which consists, given a system of linear relations, of nding a maximum feasible subsystem, that is a solution satisfying as many relations as possible. The computational complexity of this general problem, named Max FLS, is investigated for the four types of relations =, , > and 6 =. Various constrained versions of Max FLS, where a subset of relations must be ...
متن کاملTight Lower Bounds on the Approximability of Some NPO PB Complete Problems
We investigate the approximability of the NPO PB complete problems Min Ones Min Dones Max Ones Max Dones and Max PB Programming We show that unless P NP these problems are not approximable within n for any where n is the number of variables in the input Since all of these problems are approximable within n this lower bound is close to optimal
متن کاملApproximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interesting problems in, for example, integer programming, equation solving, and graph theory. The approximability of this problem has previously been studied in the two-element case [Khanna et al, ‘The approximability of co...
متن کاملThe Approximability of Constraint Satisfaction Problems
We study optimization problems that may be expressed as “Boolean constraint satisfaction problems.” An instance of a Boolean constraint satisfaction problem is given by m constraints applied to n Boolean variables. Different computational problems arise from constraint satisfaction problems depending on the nature of the “underlying” constraints as well as on the goal of the optimization task. ...
متن کاملOn the Approximability of the Selection Problem
Under the assumption EXPTIME 6= NEXPTIME, we show the nonexistence of polynomial-time bounded-error approximation algorithms solving the MAX-Selection problem. In addition, a linear reduction from the MAX2SAT problem to the MAX-Selection problem is given. Therefore, if there exists a polynomial-time approximation scheme for the MAX-Selection problem, then P = NP.
متن کامل